Reversible Space Equals Deterministic Space
نویسندگان
چکیده
This paper describes the simulation of an S(n) spacebounded deterministic Turing machine by a reversible Turing machine operating in space S(n). It thus answers a question posed by Bennett in 1989 and refutes the conjecture, made by Li and Vitanyi in 1996, that any reversible simulation of an irreversible computation must obey Bennett’s reversible pebble game rules.
منابع مشابه
A Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملSpace-Efficient Reversible Simulations
We study constructions that convert arbitrary deterministic Turing machines to reversible machines; i.e. reversible simulations. Specifically, we study space-efficient simulations; that is, the resulting reversible machine uses O(f(S)) space, where S is the space usage of the original machine and f is very close to linear (say, n log n or smaller). We generalize the previous results on this rev...
متن کاملA composite explicit iterative process with a viscosity method for Lipschitzian semigroup in a smooth Banach space
متن کامل
On thermodynamic and microscopic reversibility
The word ‘reversible’ has two (apparently) distinct applications in statistical thermodynamics. A thermodynamically reversible process indicates an experimental protocol for which the entropy change is zero, whereas the principle of microscopic reversibility asserts that the probability of any trajectory of a system through phase space equals that of the time reversed trajectory. However, these...
متن کاملA study of Landau damping with random initial inputs
For the Vlasov-Poisson equation with random uncertain initial data, we prove that the Landau damping solution given by the deterministic counterpart (Caglioti and Maffei, J. Stat. Phys., 92:301-323, 1998) depends smoothly on the random variable if the time asymptotic profile does, under the smoothness and smallness assumptions similar to the deterministic case. The main idea is to generalize th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 60 شماره
صفحات -
تاریخ انتشار 1997